首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   4153篇
  免费   675篇
  国内免费   163篇
化学   450篇
晶体学   5篇
力学   767篇
综合类   71篇
数学   1361篇
物理学   2337篇
  2024年   3篇
  2023年   40篇
  2022年   68篇
  2021年   75篇
  2020年   96篇
  2019年   110篇
  2018年   105篇
  2017年   153篇
  2016年   147篇
  2015年   113篇
  2014年   222篇
  2013年   258篇
  2012年   192篇
  2011年   261篇
  2010年   221篇
  2009年   274篇
  2008年   278篇
  2007年   267篇
  2006年   238篇
  2005年   232篇
  2004年   186篇
  2003年   210篇
  2002年   202篇
  2001年   127篇
  2000年   128篇
  1999年   110篇
  1998年   88篇
  1997年   89篇
  1996年   62篇
  1995年   66篇
  1994年   49篇
  1993年   37篇
  1992年   41篇
  1991年   31篇
  1990年   29篇
  1989年   43篇
  1988年   18篇
  1987年   19篇
  1986年   22篇
  1985年   16篇
  1984年   12篇
  1982年   16篇
  1981年   4篇
  1980年   6篇
  1979年   8篇
  1978年   3篇
  1976年   2篇
  1974年   2篇
  1973年   3篇
  1971年   2篇
排序方式: 共有4991条查询结果,搜索用时 812 毫秒
1.
《Discrete Mathematics》2020,343(2):111679
A path in an edge-colored graph G is called monochromatic if any two edges on the path have the same color. For k2, an edge-colored graph G is said to be monochromatic k-edge-connected if every two distinct vertices of G are connected by at least k edge-disjoint monochromatic paths, and G is said to be uniformly monochromatic k-edge-connected if every two distinct vertices are connected by at least k edge-disjoint monochromatic paths such that all edges of these k paths are colored with a same color. We use mck(G) and umck(G) to denote the maximum number of colors that ensures G to be monochromatic k-edge-connected and, respectively, G to be uniformly monochromatic k-edge-connected. In this paper, we first conjecture that for any k-edge-connected graph G, mck(G)=e(G)e(H)+k2, where H is a minimum k-edge-connected spanning subgraph of G. We verify the conjecture for k=2. We also prove the conjecture for G=Kk+1 and G=Kk,n with nk3. When G is a minimal k-edge-connected graph, we give an upper bound of mck(G), i.e., mck(G)k1. For the uniformly monochromatic k-edge-connectivity, we prove that for all k, umck(G)=e(G)e(H)+1, where H is a minimum k-edge-connected spanning subgraph of G.  相似文献   
2.
Results from 5D induced-matter and membrane theory with null paths are extended to show that a particle obeys the 4D Klein-Gordon equation but with a variable mass. The Dirac equation also follows, but raises concerns about 4D quantization in the two natural 5D gauges, and reopens the question of a Regge-like trajectory for the spin angular momenta and squared masses of gravitationally-dominated systems.  相似文献   
3.
The NMR properties of nuclei linked to long linear polymer molecules are sensitive to the influence of hard walls. In this context, the residual energy of tensorial spin-spin interactions is calculated using a path integral approach. Several thermodynamic quantities of the polymer system (free energy, equation of state,...) are also expressed, taking chain stiffness effects and the presence of two repulsive walls into consideration.  相似文献   
4.
Effective magnetic properties of a composite meta-material consisting of periodically arranged circular conductive elements are studied theoretically. A general expression for the effective bulk permeability is obtained with mutual effects and lattice ordering being taken into account. The resonance frequency of the permeability is found to be strongly dependent on the size and shape of the unit cell. Frequency dispersion of the permeability is studied with special attention paid to the frequency range, where negative values of the permeability are possible. Corresponding recommendations for optimisation of the meta-materials with negative permeability are made. The results are confirmed by numerical simulations of the finite structure behaviour in an external magnetic field. Received 19 April 2002 Published online 31 July 2002  相似文献   
5.
迈克尔逊干涉仪中补偿板与干涉条纹   总被引:1,自引:0,他引:1  
通过分析缺失补偿板的迈克尔逊干涉仪中的附加光程差,推出干涉条纹满足的方程式,并用计算机模拟了动镜移动过程中变化的干涉条纹,与实验结果相一致.  相似文献   
6.
Let G=(V(G),E(G)) be a graph. A (n,G, λ)‐GD is a partition of the edges of λKn into subgraphs (G‐blocks), each of which is isomorphic to G. The (n,G,λ)‐GD is named as graph design for G or G‐decomposition. The large set of (n,G,λ)‐GD is denoted by (n,G,λ)‐LGD. In this work, we obtain the existence spectrum of (n,P3,λ)‐LGD. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 151–159, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10008  相似文献   
7.
Stability properties of Feynman's operational calculus are addressed in the setting of exponential functions of noncommuting operators. Applications of some of the stability results are presented. In particular, the time-dependent perturbation theory of nonrelativistic quantum mechanics is presented in the setting of the operational calculus and application of the stability results of this paper to the perturbation theory are discussed.  相似文献   
8.
舒兴明 《大学数学》2002,18(3):44-47
本文利用局部比较法 ,在图中定义子图、无效路径、以及可去边 .利用推导的有关定理 ,拆去可去边 ,利用最短路径相同的等价性 ,达到化简图 ,从而求出最短路径  相似文献   
9.
A Dirac picture perturbation theory is developed for the time evolution operator in classical dynamics in the spirit of the Schwinger–Feynman–Dyson perturbation expansion and detailed rules are derived for computations. Complexification formalisms are given for the time evolution operator suitable for phase space analyses, and then extended to a two-dimensional setting for a study of the geometrical Berry phase as an example. Finally a direct integration of Hamilton's equations is shown to lead naturally to a path integral expression, as a resolution of the identity, as applied to arbitrary functions of generalized coordinates and momenta.  相似文献   
10.
介绍了几种光纤干涉仪等臂长技术,比较了各自的优缺点和适用范围,对光纤干涉仪的平衡有较大的参考价值。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号